Numerical methods for generalized least squares problems
نویسندگان
چکیده
Usually generalized least squares problems are solved by transforming them into regular least squares problems which can then be solved by well-known numerical methods. However, this approach is not very effective in some cases and, besides, is very expensive for large scale problems. In 1979, Paige suggested another approach which consists of solving an equivalent equality-constrained least squares problem by the orthogonal decomposition, the BNP algorithm or the James' implicit nullspace iterative methods. In this paper, we present some new developments of the numerical methods, for example, 2-cycle SOR method and preconditioned conjugate gradient method, for generalized least squares problems. Some numerical comparisons are included as well.
منابع مشابه
Approximate Generalized Inverse Preconditioning Methods for Least Squares Problems
iv erative methods to solve least squares problems more efficiently. We especially focused on one kind of preconditioners, in which preconditioners are the approximate generalized inverses of the coefficient matrices of the least squares problems. We proposed two different approaches for how to construct the approximate generalized inverses of the coefficient matrices: one is based on the Minim...
متن کاملFast Enclosure for Solutions of Generalized Least Squares Problems∗
Fast algorithms for enclosing solutions of generalized least squares problems are proposed. To develop these algorithms, theories for obtaining error bounds on numerical solutions are established. The error bounds obtained by these algorithms are “verified” in the sense that all the possible rounding errors have been taken into account. A technique for obtaining smaller error bounds is introduc...
متن کاملDetermination of the best-fitting reference orbit for a LEO satellite using the Lagrange coefficients
Linearization of the nonlinear equations and iterative solution is the most well-known scheme in many engineering problems. For geodetic applications of the LEO satellites, e.g. the Earth’s gravity field recovery, one needs to provide an initial guess of the satellite location or the so-called reference orbit. Numerical integration can be utilized for generating the reference orbit if a satelli...
متن کاملConvergence of Inner-Iteration GMRES Methods for Least Squares Problems
We develop a general convergence theory for the generalized minimal residual method for least squares problems preconditioned with inner iterations. The inner iterations are performed by stationary iterative methods. We also present theoretical justifications for using specific inner iterations such as the Jacobi and SOR-type methods. The theory is improved particularly in the rankdeficient cas...
متن کاملGMRES Methods for Least Squares Problems
The standard iterative method for solving large sparse least squares problems min ∈Rn ‖ −A ‖2, A ∈ Rm×n is the CGLS method, or its stabilized version LSQR, which applies the (preconditioned) conjugate gradient method to the normal equation ATA = AT . In this paper, we will consider alternative methods using a matrix B ∈ Rn×m and applying the Generalized Minimal Residual (GMRES) method to min ∈R...
متن کامل